Verification of Collision Avoidance Systems Using Reachability Analysis
نویسندگان
چکیده
This paper presents a method for formal verification of automotive collision avoidance systems. Using viability theory and reachability analysis, we define when the system should intervene, i.e. the unsafe set, and when the system should not intervene, i.e. the safe set. Given these sets, we formulate the problem of verifying that a given system does not make incorrect decisions as an optimization problem. The method is demonstrated on a collision avoidance system example and, given the models used and absence of measurements errors, we show that the system does not make incorrect decisions. Furthermore, we describe and demonstrate how to evaluate the robustness to measurement errors, using the proposed framework.
منابع مشابه
Reachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملSymbolic Reachability Analysis of Lazy Linear Hybrid Automata
Lazy linear hybrid automata (LLHA) model the discrete time behavior of control systems containing finite-precision sensors and actuators interacting with their environment under bounded inertial delays. In this paper, we present a symbolic technique for reachability analysis of lazy linear hybrid automata. The model permits invariants and guards to be nonlinear predicates but requires flow valu...
متن کاملRoad to safe autonomy with data and formal reasoning
We present an overview of recently developed data-driven tools for safety analysis of autonomous vehicles and advanced driver assist systems. The core algorithms combine model-based, hybrid system reachability analysis with sensitivity analysis of components with unknown or inaccessible models. We illustrate the applicability of this approach with a new case study of emergency braking systems i...
متن کاملReachability Analysis for Robotic Motion Planning using Techniques from Verification of Hybrid Systems
We consider verification of the property that a control policy, combined with a specific robot system in a known environment, will lead to collision-free paths that always reach a goal. This is a stepping stone towards combining heuristic policies with verification to avoid computing optimal state feedback policies. We first discuss the difficulty of the Navigation Problem and why we turn to st...
متن کاملCompleteness and Consistency in Hierarchical State-Based Requirements - Software Engineering, IEEE Transactions on
This paper describes methods for automatically analyzing formal, state-based requirements specifications for some aspects of completeness and consistency. The approach uses a low-level functional formalism, simplifying the analysis process. State-space explosion problems are eliminated by applying the analysis at a high level of abstraction; i.e., instead of generating a reachability graph for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014